Global error bounds for piecewise convex polynomials
نویسنده
چکیده
In this paper, by examining the recession properties of convex polynomials, we provide a necessary and sufficient condition for a piecewise convex polynomial to have a Hölder-type global error bound with an explicit Hölder exponent. Our result extends the corresponding results of [25] from piecewise convex quadratic functions to piecewise convex polynomials.
منابع مشابه
Finding Bounds on Ehrhart Quasi-Polynomials
Numerous problems in program analysis, can be reduced to finding bounds on the number of integer points in a convex set, or the solution of a more general polyhedral counting problem. For a large class of applications the solution of such a counting problem can be expressed as a piecewise Ehrhart quasi-polynomial in the parameters. This work presentsmethods to find bounds on quasi-polynomials o...
متن کاملGlobal convergence of an inexact interior-point method for convex quadratic symmetric cone programming
In this paper, we propose a feasible interior-point method for convex quadratic programming over symmetric cones. The proposed algorithm relaxes the accuracy requirements in the solution of the Newton equation system, by using an inexact Newton direction. Furthermore, we obtain an acceptable level of error in the inexact algorithm on convex quadratic symmetric cone programmin...
متن کاملError bounds for monomial convexification in polynomial optimization
Convex hulls of monomials have been widely studied in the literature, and monomial convexifications are implemented in global optimization software for relaxing polynomials. However, there has been no study of the error in the global optimum from such approaches. We give bounds on the worst-case error for convexifying a monomial over subsets of [0, 1]. This implies additive error bounds for rel...
متن کاملGlobal Error Bounds for Systems of Convex Polynomials over Polyhedral Constraints
This paper is devoted to study the Lipschitzian/Holderian type global error bound for systems of many finitely convex polynomial inequalities over a polyhedral constraint. Firstly, for systems of this type, we show that under a suitable asymtotic qualification condition, the Lipschitzian type global error bound property is equivalent to the Abadie qualification condition, in particular, the Lip...
متن کاملConvex Polynomial and Spline Approximation in Lp , 0 < p <
We prove that a convex function f 6 L p [ -1 , 1], 0 < p < cx~, can be approximated by convex polynomials with an error not exceeding Cw~ (f, 1/n)p where w~(f, .) is the Ditzian-Totik modulus of smoothness of order three of f . We are thus filling the gap between previously known estimates involving og~(f, I/n)p, and the impossibility of having such estimates involving ~o4. We also give similar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Program.
دوره 137 شماره
صفحات -
تاریخ انتشار 2013